Set Valued Attributes
نویسندگان
چکیده
About three decades ago, when Codd (1970) invented the relational database model, it took the database world by storm. The enterprises that adapted it early won a large competitive edge. The past two decades have witnessed tremendous growth of relational database systems, and today the relational model is by far the dominant data model and is the foundation for leading DBMS products, including IBM DB2, Informix, Oracle, Sybase, and Microsoft SQL server. Relational databases have become a multibillion-dollar industry. However, as these databases grew so did the complexity of the data being stored in them with the emergence of a new class of applications. It quickly became apparent that relational databases suffer from various deficiencies and limitations. Relational database systems support a small, fixed collection of data types (e.g., integers, dates, strings) that has been proven to be adequate for traditional applications. With a new class of applications, more complex data needs to be handled. These complex data include hierarchical data of computer-aided design and modeling (CAD/CAM), multimedia data, and documents. Support for this kind of data requires the database to incorporate abstract data types and type constructors based on object-oriented concepts. This leads to the development of object database systems along two distinct paths:
منابع مشابه
Hierarchical Bitmap Index: An Efficient and Scalable Indexing Technique for Set-Valued Attributes
Set-valued attributes are convenient to model complex objects occurring in the real world. Currently available database systems support the storage of set-valued attributes in relational tables but contain no primitives to query them efficiently. Queries involving set-valued attributes either perform full scans of the source data or make multiple passes over single-value indexes to reduce the n...
متن کاملSome Results about Set-Valued Complementarity Problem
This paper is devoted to consider the notions of complementary problem (CP) and set-valued complementary problem (SVCP). The set-valued complementary problem is compared with the classical single-valued complementary problem. Also, the solution set of the set-valued complementary problem is characterized. Our results illustrated by some examples. This paper is devoted to co...
متن کاملAchieving ontology interoperability using formal concept analysis: an approach to inter-organizational collaboration
Semantic systems that are based on ontologies are required to facilitate the collaboration between project teams and stakeholders in the infrastructure and construction domain. However, since no one ontology will be universally accepted, techniques are needed to achieve interoperability between different ontologies. This paper proposes an approach based on formal concept analysis (FCA) and rela...
متن کاملSolving robot selection problem by a new interval-valued hesitant fuzzy multi-attributes group decision method
Selecting the most suitable robot among their wide range of specifications and capabilities is an important issue to perform the hazardous and repetitive jobs. Companies should take into consideration powerful group decision-making (GDM) methods to evaluate the candidates or potential robots versus the selected attributes (criteria). In this study, a new GDM method is proposed by utilizi...
متن کاملLower semicontinuity for parametric set-valued vector equilibrium-like problems
A concept of weak $f$-property for a set-valued mapping is introduced, and then under some suitable assumptions, which do not involve any information about the solution set, the lower semicontinuity of the solution mapping to the parametric set-valued vector equilibrium-like problems are derived by using a density result and scalarization method, where the constraint set $K$...
متن کاملIndex Structures for Databases Containing Data Items with Set-valued Attributes Index Structures for Databases Containing Data Items with Set-valued Attributes
We introduce two new hash-based index structures to index set-valued attributes. Both are able to support subset and superset queries. Analytical cost models for the new index structures as well as for the two existing index structures, sequential signature le and Russian Doll Tree, are presented and experimentally validated. Using the validated cost model, we express the performance of all fou...
متن کامل